Nested Types
نویسندگان
چکیده
We currently see a convergence of module systems and type systems for object-oriented programming. This convergence is driven by the demands of large scale component systems. Objectoriented languages for medium-scale systems such as Eiffel or Sather still worked with an unstructured set of classes, but as systems grow this becomes less practical. Consequently, more recent languages such as Beta [MMPN93] or Java [GJS96] allow for class nesting. Class nesting raises issues such as hiding and refinement that have first been studied in module systems. On the other hand, recent module systems embody many of the properties of class systems, e.g. first-class modules[Rus98], mixin modules [Dug96], or recursion between modules.
منابع مشابه
A Nested RT-PCR Method for Confirming the Absence of all Three Types of Polioviruses in Primates and Human Cells Used in Vaccine Production
No abstract this article: A Nested RT-PCR Method for Confirming the Absence of all Three Types of Polioviruses in Primates and Human Cells Used in Vaccine Production
متن کاملBovine Leukaemia Virus onco-protein Tax antigen identification in human lymphomas tissue
Background: Bovine leukaemia virus (BLV) is the primary cause of enzootic bovine leukaemia which belongs to the HTLV/BLV group of oncogenic retroviruses including Human T-cell leukaemia virus types 1, 2, and 3 and simian T-lymphotropic virus. Due to daily consumption of milk, meat and other dairy by-products, a possible role in appearing human cancers can be assumed for BLV. Materials and Metho...
متن کاملA new method for fuzzification of nested dummy variables by fuzzy clustering membership functions and its application in financial economy
In this study, the aim is to propose a new method for fuzzification of nested dummy variables. The fuzzification idea of dummy variables has been acquired from non-linear part of regime switching models in econometrics. In these models, the concept of transfer functions is like the notion of fuzzy membership functions, but no principle or linguistic sentence have been used for inputs. Consequen...
متن کاملHaskell Programming with Nested Types: A Principled Approach
Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold combinator which encapsulates structured recursion over data of that type, and a fold/build rule which optimises modular programs by eliminating from...
متن کاملHaskell Programming with Nested Types : A Principled
Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold combinator which encapsulates structured recursion over data of that type, and a fold/build rule which optimises modular programs by eliminating from...
متن کاملRepresenting Nested Inductive Types Using W-Types
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-Löf category (extensive locally cartesian closed category with W-types) by exploiting our work on container types. This generalises a result by Dybjer (1997) who showed that non-nested strictly positive inductive types can be re...
متن کامل